Third-Order Computation and Bounded Arithmetic
نویسندگان
چکیده
منابع مشابه
Third-Order Computation and Bounded Arithmetic
We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characterizations of several large complexity classes. We then present a number of third-order theories of bounded arithmetic whose definable functions are the classes of the EXP-time hierarchy in the third-order setting.
متن کاملA Third-Order Bounded Arithmetic Theory for PSPACE
We present a novel third-order theory W 1 1 of bounded arithmetic suitable for reasoning about PSPACE functions. This theory has the advantages of avoiding the smash function symbol and is otherwise much simpler than previous PSPACE theories. As an example we outline a proof in W 1 1 that from any configuration in the game of Hex, at least one player has a winning strategy. We then exhibit a tr...
متن کاملDeterminacy in third order arithmetic
In recent work, Schweber [7] introduces a framework for reverse mathematics in a third order setting and investigates several natural principles of transfinite recursion. The main result of that paper is a proof, using the method of forcing, that in the context of two-person perfect information games with moves in R, open determinacy (Σ1 -DET) is not implied by clopen determinacy (∆ R 1 -DET). ...
متن کاملFrom Bounded Arithmetic to Second Order Arithmetic via Automorphisms
In this paper we examine the relationship between automorphisms of models of I∆0 (bounded arithmetic) and strong systems of arithmetic, such as PA, ACA0 (arithmetical comprehension schema with restricted induction), and Z2 (second order arithmetic). For example, we establish the following characterization of PA by proving a “reversal” of a theorem of Gaifman: Theorem. The following are equivale...
متن کاملAxiomatizing Mathematical Conceptualism in Third Order Arithmetic
We review the philosophical framework of mathematical conceptualism as an alternative to set-theoretic foundations and show how mainstream mathematics can be developed on this basis. The paper includes an explicit axiomatization of the basic principles of conceptualism in a formal system CM set in the language of third order arithmetic. This paper is part of a project whose goal is to make a ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logic and Computation
سال: 2007
ISSN: 0955-792X,1465-363X
DOI: 10.1093/logcom/exm040